🇬🇧 en de 🇩🇪

directed graph noun

  • (graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
 gerichteter Graph
Wiktionary Links